Oriented Crossover in Genetic Algorithms for Computer Networks Optimization

نویسندگان

چکیده

Optimization using genetic algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover an essential operator of the algorithm. It has been active area research to develop sustainable forms for this operand. In work, new operand proposed. This depends on giving elicited description chromosome with structure alleles parents. suggested that each allele two attitudes, one attitude differs contrastingly other, and both them complement allele. Thus, case where good, other should be bad. suitable many systems which contain admired parameters unadmired parameters. proposed would improve desired attitudes dampen undesired attitudes. can achieved stages: first stage mating method parent improving at expense other. second comes after improvement between different Hence, concurrent steps applied. Simulation experiments system show fitness function. could helpful fields, especially optimize routing network protocols, application tested as study work.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagonal Crossover in Genetic Algorithms for Numerical Optimization

In this paper the results of a detailed investigation on a multi-parent recombination operator, diagonal crossover, are reported. Although earlier publications have indicated the high performance of diagonal crossover on a number of problems, so far it has not been investigated whether high performance is indeed a result of using a high number of parents. Here we formulate three hypotheses to e...

متن کامل

Hierarchical Crossover in Genetic Algorithms

This paper identifies the limitations of conventional crossover in genetic algorithms when operating on two chromosomes of differing lengths. To address these problems, the concept of a Semantic Hierarchy (i.e. tree of meaning) of a genotype within a genetic algorithm is introduced. With this in mind, a new form of crossover operator known as Hierarchical Crossover is presented, capable of perf...

متن کامل

Anycasting in connection-oriented computer networks: Models, algorithms and results

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content De...

متن کامل

A Novel Crossover Operator for Genetic Algorithms: Ring Crossover

The genetic algorithm (GA) is an optimization and search technique based on the principles of genetics and natural selection. A GA allows a population composed of many individuals to evolve under specified selection rules to a state that maximizes the “fitness” function. In that process, crossover operator plays an important role. To comprehend the GAs as a whole, it is necessary to understand ...

متن کامل

A New Crossover Operator for Genetic Algorithms

Starting from a mathematical reinterpretation of the classical crossover operator, a new type of crossover is introduced. The proposed new crossover operator gives better performances than the classical 1 point, 2 point or uniform crossover operators. In the paper a theorical investigation of the behaviour of the new crossover is presented. In comparison to the classical crossover operator, it ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information

سال: 2023

ISSN: ['2078-2489']

DOI: https://doi.org/10.3390/info14050276